Quadratic Knapsack Relaxations Using Cutting Planes and Semidefinite Programming
نویسندگان
چکیده
منابع مشابه
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
The Reformulation-Linearization Technique (RLT), due to Sherali and Adams, can be used to construct hierarchies of linear programming relaxations of mixed 0-1 polynomial programs. As one moves up the hierarchy, the relaxations grow stronger, but the number of variables increases exponentially. We present a procedure that generates cutting planes at any given level of the hierarchy, by optimally...
متن کاملUpper bounds for the binary quadratic knapsack problem
We address the binary quadratic knapsack problem (QKP) of selecting from a set of items, a subset with maximum profit, and whose overall weight does not exceed a given capacity c. The objective function of the problem, which measures the profit of the selection, is a nonconvex quadratic function, and the QKP is naturally formulated as a quadratic binary problem. Several works have proposed rela...
متن کاملKnapsack-Based Cutting Planes for the Max-Cut Problem
We present a new procedure for generating cutting planes for the max-cut problem. The procedure consists of three steps. First, we generate a violated (or near-violated) linear inequality that is valid for the semidefinite programming (SDP) relaxation of the max-cut problem. This can be done by computing the minimum eigenvalue of a certain matrix. Second, we use this linear inequality to constr...
متن کاملSecond-Order Cone Relaxations for Binary Quadratic Polynomial Programs
Several types of relaxations for binary quadratic polynomial programs can be obtained using linear, secondorder cone, or semidefinite techniques. In this paper, we propose a general framework to construct conic relaxations for binary quadratic polynomial programs based on polynomial programming. Using our framework, we re-derive previous relaxation schemes and provide new ones. In particular, w...
متن کاملQuadratic Knapsack Relaxations Using Cutting Planes andSemide nite
We investigate dominance relations between basic semideenite relaxations and classes of cuts. We show that simple semideenite relaxations are tighter than corresponding linear relaxations even in case of linear cost functions. Numerical results are presented illustrating the quality of these relaxations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995